Two Computational Primitives for Algorithmic Self-Assembly: Copying and Counting Supporting Information
نویسندگان
چکیده
1 Methods Estimated bound on effective error rates: Given an assembly of tiles on a scaffold of N repeat units in which each tile has a mismatch with its lower or right neighbor with independent probability = 1−p, we would like to bound the probability that the assembly contains a particular pattern of M tiles that has been observed. In particular, we are interested in the probability of seeing any pattern with fewer than m mismatched tiles. At a particular location along the scaffold, the probability that the relevant M tiles have fewer than m mismatches is
منابع مشابه
Two computational primitives for algorithmic self-assembly: copying and counting.
Copying and counting are useful primitive operations for computation and construction. We have made DNA crystals that copy and crystals that count as they grow. For counting, 16 oligonucleotides assemble into four DNA Wang tiles that subsequently crystallize on a polymeric nucleating scaffold strand, arranging themselves in a binary counting pattern that could serve as a template for a molecula...
متن کاملAn information-bearing seed for nucleating algorithmic self-assembly.
Self-assembly creates natural mineral, chemical, and biological structures of great complexity. Often, the same starting materials have the potential to form an infinite variety of distinct structures; information in a seed molecule can determine which form is grown as well as where and when. These phenomena can be exploited to program the growth of complex supramolecular structures, as demonst...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملSpatial Computation and Algorithmic Information content in Non-DNA based Molecular Self-Assembly
Porphyrins are molecular units with fourfold symmetry and suitable for solid substrate deposition. The chemical structure of a porphyrin molecule reveals four structural units which can be synthesised with different substituent functional groups. The adequate selection of functional groups plays a central role in defining the correct intermolecular bindings that lead to a precisely tuned spatia...
متن کاملAlgorithmic DNA Self-assembly
Self-assembly is a process by which simple objects autonomously assemble into complexes. This phenomenon is common in nature but is not yet well understood from mathematical and programming perspectives. It is believed that self-assembly technology will ultimately permit the precise fabrication of complex nanostructures. There are many kinds of self-assembly and DNA self-assembly is of particul...
متن کامل